var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\",\"authorFirst\":\"1\",\"nocache\":\"1\",\"fullnames\":\"1\",\"theme\":\"bullets\",\"group0\":\"year\",\"group1\":\"type\",\"owner\":\"{}\",\"filter\":\"tags:(SCS|SrcChan)\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal in two general scenarios and is approximately optimal in a third scenario. The two scenarios for which separation is optimal complement each other: the first is when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, but the channels in this network are synchronized, orthogonal, and memoryless point-to-point channels; the second is when the memoryless sources are mutually independent, each of which is to be reconstructed only at one destination within a certain distortion, but the channels are general, including multi-user channels, such as multiple access, broadcast, interference, and relay channels, possibly with feedback. The third scenario, for which we demonstrate approximate optimality of source-channel separation, generalizes the second scenario by allowing each source to be reconstructed at multiple destinations with different distortions. For this case, the loss from optimality using the separation approach can be upper-bounded when a difference distortion measure is taken, and in the special case of quadratic distortion measure, this leads to universal constant bounds.\",\"author\":[{\"firstnames\":[\"Chao\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"Jun\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Shamai\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2013.2291787\",\"issn\":\"0018-9448\",\"journal\":\"Information Theory, IEEE Transactions on\",\"month\":\"Feb\",\"number\":\"2\",\"pages\":\"904-918\",\"tags\":\"journal,SrcChan,IT\",\"title\":\"Optimality and Approximate Optimality of Source-Channel Separation in Networks\",\"url_arxiv\":\"http://arxiv.org/abs/1004.2648\",\"volume\":\"60\",\"year\":\"2014\",\"bibtex\":\"@article{6671968,\\n abstract = {We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal in two general scenarios and is approximately optimal in a third scenario. The two scenarios for which separation is optimal complement each other: the first is when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, but the channels in this network are synchronized, orthogonal, and memoryless point-to-point channels; the second is when the memoryless sources are mutually independent, each of which is to be reconstructed only at one destination within a certain distortion, but the channels are general, including multi-user channels, such as multiple access, broadcast, interference, and relay channels, possibly with feedback. The third scenario, for which we demonstrate approximate optimality of source-channel separation, generalizes the second scenario by allowing each source to be reconstructed at multiple destinations with different distortions. For this case, the loss from optimality using the separation approach can be upper-bounded when a difference distortion measure is taken, and in the special case of quadratic distortion measure, this leads to universal constant bounds.},\\n author = {Chao Tian and Jun Chen and Diggavi, S.N. and Shamai, S.},\\n doi = {10.1109/TIT.2013.2291787},\\n issn = {0018-9448},\\n journal = {Information Theory, IEEE Transactions on},\\n month = {Feb},\\n number = {2},\\n pages = {904-918},\\n tags = {journal,SrcChan,IT},\\n title = {Optimality and Approximate Optimality of Source-Channel Separation in Networks},\\n type = {2},\\n url_arxiv = {http://arxiv.org/abs/1004.2648},\\n volume = {60},\\n year = {2014}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Chen, J.\",\"Diggavi, S.\",\"Shamai, S.\"],\"key\":\"6671968\",\"id\":\"6671968\",\"bibbaseid\":\"tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2014\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/1004.2648\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the sources, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters satisfy certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. Explicit and novel outer bounds are derived for the two problems as the byproducts of our investigation.\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"firstnames\":[\"S.\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai Shitz\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2017.2701807\",\"issn\":\"1557-9654\",\"journal\":\"IEEE Transactions on Information Theory\",\"keywords\":\"broadcast channels;Gaussian channels;mean square error methods;multiuser channels;matched multiuser Gaussian source channel communications;uncoded schemes;Gaussian broadcast channel;mean squared error distortion measure;correlated Gaussian sources;Gaussian multiple-access channel;mean squared error distortion;distortion tuples;optimization problem;region characterization problems;Distortion;Distortion measurement;Optimization;Receivers;Noise measurement;Decoding;Encoding;Broadcast;multiple access;combined source-channel coding\",\"month\":\"July\",\"number\":\"7\",\"pages\":\"4155-4171\",\"tags\":\"journal,IT,SCS\",\"title\":\"Matched Multiuser Gaussian Source Channel Communications via Uncoded Schemes\",\"volume\":\"63\",\"year\":\"2017\",\"bibtex\":\"@article{7920290,\\n abstract = {We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the sources, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters satisfy certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. Explicit and novel outer bounds are derived for the two problems as the byproducts of our investigation.},\\n author = {C. {Tian} and J. {Chen} and S. N. {Diggavi} and S. {Shamai Shitz}},\\n doi = {10.1109/TIT.2017.2701807},\\n issn = {1557-9654},\\n journal = {IEEE Transactions on Information Theory},\\n keywords = {broadcast channels;Gaussian channels;mean square error methods;multiuser channels;matched multiuser Gaussian source channel communications;uncoded schemes;Gaussian broadcast channel;mean squared error distortion measure;correlated Gaussian sources;Gaussian multiple-access channel;mean squared error distortion;distortion tuples;optimization problem;region characterization problems;Distortion;Distortion measurement;Optimization;Receivers;Noise measurement;Decoding;Encoding;Broadcast;multiple access;combined source-channel coding},\\n month = {July},\\n number = {7},\\n pages = {4155-4171},\\n tags = {journal,IT,SCS},\\n title = {Matched Multiuser Gaussian Source Channel Communications via Uncoded Schemes},\\n type = {2},\\n volume = {63},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Chen, J.\",\"Diggavi, S. N.\",\"Shamai Shitz, S.\"],\"key\":\"7920290\",\"id\":\"7920290\",\"bibbaseid\":\"tian-chen-diggavi-shamaishitz-matchedmultiusergaussiansourcechannelcommunicationsviauncodedschemes-2017\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"broadcast channels;Gaussian channels;mean square error methods;multiuser channels;matched multiuser Gaussian source channel communications;uncoded schemes;Gaussian broadcast channel;mean squared error distortion measure;correlated Gaussian sources;Gaussian multiple-access channel;mean squared error distortion;distortion tuples;optimization problem;region characterization problems;Distortion;Distortion measurement;Optimization;Receivers;Noise measurement;Decoding;Encoding;Broadcast;multiple access;combined source-channel coding\"],\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.\",\"author\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Hachem\"],\"suffixes\":[]},{\"firstnames\":[\"U.\"],\"propositions\":[],\"lastnames\":[\"Niesen\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"doi\":\"10.1109/LCOMM.2018.2822694\",\"issn\":\"1558-2558\",\"journal\":\"IEEE Communications Letters\",\"keywords\":\"array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks\",\"month\":\"July\",\"number\":\"7\",\"pages\":\"1434-1437\",\"tags\":\"journal,CCWN,IT,ANIT,WiNetnew,SCS\",\"title\":\"Energy-Efficiency Gains of Caching for Interference Channels\",\"url_arxiv\":\"https://arxiv.org/abs/1808.00653\",\"volume\":\"22\",\"year\":\"2018\",\"bibtex\":\"@article{8335768,\\n abstract = {This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.},\\n author = {J. {Hachem} and U. {Niesen} and S. {Diggavi}},\\n doi = {10.1109/LCOMM.2018.2822694},\\n issn = {1558-2558},\\n journal = {IEEE Communications Letters},\\n keywords = {array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks},\\n month = {July},\\n number = {7},\\n pages = {1434-1437},\\n tags = {journal,CCWN,IT,ANIT,WiNetnew,SCS},\\n title = {Energy-Efficiency Gains of Caching for Interference Channels},\\n type = {2},\\n url_arxiv = {https://arxiv.org/abs/1808.00653},\\n volume = {22},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Hachem, J.\",\"Niesen, U.\",\"Diggavi, S.\"],\"key\":\"8335768\",\"id\":\"8335768\",\"bibbaseid\":\"hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018\",\"role\":\"author\",\"urls\":{\" arxiv\":\"https://arxiv.org/abs/1808.00653\"},\"keyword\":[\"array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks\"],\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Dusad\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"A\",\"R.\"],\"propositions\":[],\"lastnames\":[\"Calderbank\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Conference on Information Sciences and Systems, Princeton\",\"month\":\"March\",\"note\":\"invited paper\",\"pages\":\"\",\"tags\":\"conf,DivEmb,OppComm,SrcChan\",\"title\":\"Cross Layer Utility of Diversity Embedded Codes\",\"year\":\"2006\",\"bibtex\":\"@inproceedings{DDCj06,\\n author = {S. Dusad and S N. Diggavi and A R. Calderbank},\\n booktitle = {IEEE Conference on Information Sciences and Systems, Princeton},\\n month = {March},\\n note = {invited paper},\\n pages = {},\\n tags = {conf,DivEmb,OppComm,SrcChan},\\n title = {Cross Layer Utility of Diversity Embedded Codes},\\n type = {4},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Dusad, S.\",\"Diggavi, S N.\",\"Calderbank, A R.\"],\"key\":\"DDCj06\",\"id\":\"DDCj06\",\"bibbaseid\":\"dusad-diggavi-calderbank-crosslayerutilityofdiversityembeddedcodes-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hachem\"],\"firstnames\":[\"Jad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"Urs\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"7\",\"pages\":\"5359–5380\",\"publisher\":\"IEEE\",\"tags\":\"journal,CCWN,IT,WiNetnew,SCS,ANIT\",\"title\":\"Degrees of freedom of cache-aided wireless interference networks\",\"url_arxiv\":\"https://arxiv.org/abs/1606.03175\",\"doi\":\"10.1109/TIT.2018.2825321\",\"volume\":\"64\",\"year\":\"2018\",\"bibtex\":\"@article{hachem2018degrees,\\n abstract = {We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.},\\n author = {Hachem, Jad and Niesen, Urs and Diggavi, Suhas N},\\n journal = {IEEE Transactions on Information Theory},\\n number = {7},\\n pages = {5359--5380},\\n publisher = {IEEE},\\n tags = {journal,CCWN,IT,WiNetnew,SCS,ANIT},\\n title = {Degrees of freedom of cache-aided wireless interference networks},\\n type = {2},\\n url_arxiv = {https://arxiv.org/abs/1606.03175},\\n doi = {10.1109/TIT.2018.2825321},\\n volume = {64},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Hachem, J.\",\"Niesen, U.\",\"Diggavi, S. N\"],\"key\":\"hachem2018degrees\",\"id\":\"hachem2018degrees\",\"bibbaseid\":\"hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018\",\"role\":\"author\",\"urls\":{\" arxiv\":\"https://arxiv.org/abs/1606.03175\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"3\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hachem\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"U.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"editor\":[{\"propositions\":[],\"lastnames\":[\"Poor\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Chen\"],\"firstnames\":[\"Wei\"],\"suffixes\":[]}],\"journal\":\"Edge Caching for Mobile Networks\",\"publisher\":\"Institute of Engineering and Technology (IET) Press\",\"tags\":\"BookChap,CCWN,IT,ANIT,WiNetnew,SCS\",\"title\":\"Caching for Interference Networks: A Separation Architecture\",\"year\":\"2020\",\"bibtex\":\"@article{hachem2020caching,\\n author = {Hachem, J. and Niesen, U. and Diggavi, S.},\\n editor = {Poor, Vince and Chen, Wei},\\n journal = {Edge Caching for Mobile Networks},\\n publisher = {Institute of Engineering and Technology (IET) Press},\\n tags = {BookChap,CCWN,IT,ANIT,WiNetnew,SCS},\\n title = {Caching for Interference Networks: A Separation Architecture},\\n type = {3},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Hachem, J.\",\"Niesen, U.\",\"Diggavi, S.\"],\"editor_short\":[\"Poor, V.\",\"Chen, W.\"],\"key\":\"hachem2020caching\",\"id\":\"hachem2020caching\",\"bibbaseid\":\"hachem-niesen-diggavi-cachingforinterferencenetworksaseparationarchitecture-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Khisti\"],\"firstnames\":[\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wornell\"],\"firstnames\":[\"Gregory\",\"W.\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2011.2173629\",\"file\":\":papers:secret_keygen.pdf\",\"issn\":\"0018-9448\",\"journal\":\"Information Theory, IEEE Transactions on\",\"label\":\"kdw_j11\",\"month\":\"Feb\",\"number\":\"2\",\"pages\":\"652-670\",\"tags\":\"journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec\",\"title\":\"Secret-Key Generation Using Correlated Sources and Channels\",\"volume\":\"58\",\"year\":\"2012\",\"bibtex\":\"@article{kdw_j11,\\n abstract = {We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.},\\n author = {Khisti, A and Diggavi, S.N. and Wornell, Gregory W.},\\n doi = {10.1109/TIT.2011.2173629},\\n file = {:papers:secret_keygen.pdf},\\n issn = {0018-9448},\\n journal = {Information Theory, IEEE Transactions on},\\n label = {kdw_j11},\\n month = {Feb},\\n number = {2},\\n pages = {652-670},\\n tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},\\n title = {Secret-Key Generation Using Correlated Sources and Channels},\\n type = {2},\\n volume = {58},\\n year = {2012}\\n}\\n\\n\",\"author_short\":[\"Khisti, A\",\"Diggavi, S.\",\"Wornell, G. W.\"],\"key\":\"kdw_j11\",\"id\":\"kdw_j11\",\"bibbaseid\":\"khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Khisti\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"G\",\"W.\",\"Wornell\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT), Toronto, Canada\",\"month\":\"July\",\"note\":\"\",\"pages\":\"1005–1009\",\"tags\":\"conf,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec\",\"title\":\"Secret key generation with correlated sources and noisy channels\",\"year\":\"2008\",\"bibtex\":\"@inproceedings{KDWj08,\\n author = {A. Khisti and S N. Diggavi and G W. Wornell,},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},\\n month = {July},\\n note = {},\\n pages = {1005--1009},\\n tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},\\n title = {Secret key generation with correlated sources and noisy channels},\\n type = {4},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Khisti, A.\",\"Diggavi, S N.\",\"G W. Wornell, undefined\"],\"key\":\"KDWj08\",\"id\":\"KDWj08\",\"bibbaseid\":\"khisti-diggavi-gwwornell-secretkeygenerationwithcorrelatedsourcesandnoisychannels-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all the nodes with access to sources to be able to reconstruct all other sources observed at other nodes. We develop achievable regions and outer bounds for both these situations. For linear deterministic networks, these bounds coincide, yielding a characterization.\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"suffixes\":[]},{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"S.N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW) Cairo\",\"file\":\":papers:mtd_itw10_final.pdf\",\"month\":\"January\",\"note\":\"\",\"pages\":\"\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SrcChan,SrcChanSep,NDC,InfExch,SelConf\",\"title\":\"On source transmission over deterministic relay networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{MTDp10,\\n abstract = {Lossless transmission of a set of correlated sources\\nover a deterministic relay network is considered for two traffic\\nrequirements. In distributed multicast, the set of sources are\\nto be delivered to a set of destinations. The source exchange\\nrequires all the nodes with access to sources to be able to\\nreconstruct all other sources observed at other nodes. We develop\\nachievable regions and outer bounds for both these situations. For\\nlinear deterministic networks, these bounds coincide, yielding a\\ncharacterization.},\\n author = {S. Mohajer and C. Tian and S.N. Diggavi},\\n booktitle = {IEEE Information Theory Workshop (ITW) Cairo},\\n file = {:papers:mtd_itw10_final.pdf},\\n month = {January},\\n note = {},\\n pages = {},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SrcChan,SrcChanSep,NDC,InfExch,SelConf},\\n title = {On source transmission over deterministic relay networks},\\n type = {4},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Tian, C.\",\"Diggavi, S.\"],\"key\":\"MTDp10\",\"id\":\"MTDp10\",\"bibbaseid\":\"mohajer-tian-diggavi-onsourcetransmissionoverdeterministicrelaynetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai\"],\"suffixes\":[]}],\"booktitle\":\"Proc. of IEEE ISIT 2010, Austin, Texas\",\"month\":\"June\",\"note\":\"\",\"pages\":\"495–499\",\"tags\":\"conf,SrcChan,ITapprox,NDC,IT\",\"title\":\"Optimality and approximate optimality of source-channel separation in networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{TCDSc10a,\\n author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},\\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\\n month = {June},\\n note = {},\\n pages = {495--499},\\n tags = {conf,SrcChan,ITapprox,NDC,IT},\\n title = {Optimality and approximate optimality of source-channel \\nseparation in networks},\\n type = {4},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Chen, J.\",\"Diggavi, S N.\",\"Shamai, S.\"],\"key\":\"TCDSc10a\",\"id\":\"TCDSc10a\",\"bibbaseid\":\"tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, and the channels in this network are synchronized, orthogonal and memoryless (i.e., noisy graphs).\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai\"],\"suffixes\":[]}],\"booktitle\":\"International Conference on Signal Processing and Communications (SPCOM)\",\"file\":\":papers:tcdsspcom10.pdf\",\"month\":\"June\",\"note\":\"\",\"pages\":\"1–5\",\"tags\":\"conf,SrcChan,ITapprox,NDC,IT,SelConf\",\"title\":\"On source-channel separation in networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{TCDSc10b,\\n abstract = {We consider the source-channel separation architecture\\nfor lossy source coding in communication networks. It\\nis shown that the separation approach is optimal when the\\nmemoryless sources at source nodes are arbitrarily correlated,\\neach of which is to be reconstructed at possibly multiple\\ndestinations within certain distortions, and the channels in this\\nnetwork are synchronized, orthogonal and memoryless (i.e., noisy\\ngraphs).},\\n author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},\\n booktitle = {International Conference on Signal Processing and Communications (SPCOM)},\\n file = {:papers:tcdsspcom10.pdf},\\n month = {June},\\n note = {},\\n pages = {1--5},\\n tags = {conf,SrcChan,ITapprox,NDC,IT,SelConf},\\n title = {On source-channel separation in networks},\\n type = {4},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Chen, J.\",\"Diggavi, S N.\",\"Shamai, S.\"],\"key\":\"TCDSc10b\",\"id\":\"TCDSc10b\",\"bibbaseid\":\"tian-chen-diggavi-shamai-onsourcechannelseparationinnetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai\"],\"suffixes\":[]}],\"booktitle\":\"Proc. of IEEE ISIT 2010, Austin, Texas\",\"month\":\"June\",\"note\":\"\",\"pages\":\"146–150\",\"tags\":\"conf,SrcChan,NDC,IT\",\"title\":\"The achievable distortion region of bivariate Gaussian source on Gaussian broadcast channel\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{TDSc10a,\\n author = {C. Tian and  S N. Diggavi and S. Shamai},\\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\\n month = {June},\\n note = {},\\n pages = {146--150},\\n tags = {conf,SrcChan,NDC,IT},\\n title = {The achievable distortion region of bivariate Gaussian source on \\nGaussian broadcast channel},\\n type = {4},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Diggavi, S N.\",\"Shamai, S.\"],\"key\":\"TDSc10a\",\"id\":\"TDSc10a\",\"bibbaseid\":\"tian-diggavi-shamai-theachievabledistortionregionofbivariategaussiansourceongaussianbroadcastchannel-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"S.\",\"Shamai\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT), Seoul, Korea\",\"month\":\"June\",\"note\":\"\",\"pages\":\"2477–2481\",\"tags\":\"conf,SrcChan,ApproxIT,NDC,IT\",\"title\":\"An Approximate Characterization For the Gaussian Broadcasting Distortion Region\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{TDSj09,\\n author = {C. Tian and S N. Diggavi and S. Shamai,},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},\\n month = {June},\\n note = {},\\n pages = {2477--2481},\\n tags = {conf,SrcChan,ApproxIT,NDC,IT},\\n title = {An Approximate Characterization For the Gaussian Broadcasting Distortion Region},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Diggavi, S N.\",\"S. Shamai, undefined\"],\"key\":\"TDSj09\",\"id\":\"TDSj09\",\"bibbaseid\":\"tian-diggavi-sshamai-anapproximatecharacterizationforthegaussianbroadcastingdistortionregion-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We show that source-channel separation is approximately optimal for transmitting a Gaussian source over a bandwidth mismatched Gaussian channel, for quadratic distortion measures. Furthermore, we show that the results can be extended to general broadcast channels, and the performance of the source-channel separation based approach is also within the same constant multiplicative factors of the optimum.\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai(Shitz)\"],\"suffixes\":[]}],\"file\":\":papers:gaussianscbc_final.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"label\":\"tds_j11a\",\"month\":\"January\",\"note\":\"\",\"number\":\"1\",\"pages\":\"124-136\",\"tags\":\"journal,SrcChan,ApproxIT,NDC,IT\",\"title\":\"Approximate Characterizations for the Gaussian Broadcasting Distortion Region\",\"url_arxiv\":\"http://arxiv.org/abs/0906.3183\",\"volume\":\"57\",\"year\":\"2011\",\"bibtex\":\"@article{TDSj10a,\\n abstract = {We show that source-channel separation is approximately optimal for transmitting\\na Gaussian source over a bandwidth mismatched Gaussian channel, for quadratic distortion\\nmeasures. Furthermore, we show that the results can be extended to\\ngeneral broadcast channels, and the performance of the source-channel\\nseparation based approach is also within the same\\nconstant multiplicative factors of the optimum.},\\n author = {C. Tian and  S N. Diggavi and S. Shamai(Shitz)},\\n file = {:papers:gaussianscbc_final.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n label = {tds_j11a},\\n month = {January},\\n note = {},\\n number = {1},\\n pages = {124-136},\\n tags = {journal,SrcChan,ApproxIT,NDC,IT},\\n title = {Approximate Characterizations for the Gaussian Broadcasting Distortion Region},\\n type = {2},\\n url_arxiv = {http://arxiv.org/abs/0906.3183},\\n volume = {57},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Diggavi, S N.\",\"Shamai(Shitz), S.\"],\"key\":\"TDSj10a\",\"id\":\"TDSj10a\",\"bibbaseid\":\"tian-diggavi-shamaishitz-approximatecharacterizationsforthegaussianbroadcastingdistortionregion-2011\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/0906.3183\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Steiner\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW) Bergen, Norway\",\"month\":\"July\",\"note\":\"\",\"pages\":\"42–46\",\"tags\":\"conf,SrcChan,IT\",\"title\":\"Expected distortion for Gaussian source with broadcast transmission strategy over a fading channel\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{TSSDj07,\\n author = {C. Tian and A. Steiner and S. Shamai and S N. Diggavi},\\n booktitle = {IEEE Information Theory Workshop (ITW) Bergen, Norway},\\n month = {July},\\n note = {},\\n pages = {42--46},\\n tags = {conf,SrcChan,IT},\\n title = {Expected distortion for Gaussian source with broadcast transmission strategy over a fading channel},\\n type = {4},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Steiner, A.\",\"Shamai, S.\",\"Diggavi, S N.\"],\"key\":\"TSSDj07\",\"id\":\"TSSDj07\",\"bibbaseid\":\"tian-steiner-shamai-diggavi-expecteddistortionforgaussiansourcewithbroadcasttransmissionstrategyoverafadingchannel-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We consider the problem of transmitting a Gaussian source on a slowly fading Gaussian channel, subject to the mean squared error distortion measure. We propose an efficient algorithm to compute the optimal expected distortion at the receiver in linear time O(M), when the total number of possible discrete fading states is M. We also provide a derivation of the optimal power allocation when the fading state is a continuum, using the classical variational method.\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Steiner\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai(Shitz)\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"file\":\":papers:distortionbc_tssdfinal.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"month\":\"July\",\"note\":\"\",\"number\":\"7\",\"pages\":\"2903–2918\",\"tags\":\"journal,SrcChan,IT\",\"title\":\"Successive Refinement via Broadcasting: Optimizing Expected Distortion of a Gaussian Source over a Gaussian Fading Channel\",\"volume\":\"54\",\"year\":\"2008\",\"bibtex\":\"@article{TSSDj08,\\n abstract = {We consider the problem of transmitting a Gaussian\\nsource on a slowly fading Gaussian channel, subject to the mean\\nsquared error distortion measure.  We propose an\\nefficient algorithm to compute the optimal expected distortion at the\\nreceiver in linear time O(M), when the total number of possible discrete fading\\nstates is M. We also provide a derivation of the optimal\\npower allocation when the fading state is a continuum, using the\\nclassical variational method.},\\n author = {C. Tian and A. Steiner and S. Shamai(Shitz) and S N. Diggavi},\\n file = {:papers:distortionbc_tssdfinal.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n month = {July},\\n note = {},\\n number = {7},\\n pages = {2903--2918},\\n tags = {journal,SrcChan,IT},\\n title = {Successive Refinement via Broadcasting: Optimizing Expected Distortion of a Gaussian Source over a Gaussian Fading Channel},\\n type = {2},\\n volume = {54},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Steiner, A.\",\"Shamai(Shitz), S.\",\"Diggavi, S N.\"],\"key\":\"TSSDj08\",\"id\":\"TSSDj08\",\"bibbaseid\":\"tian-steiner-shamaishitz-diggavi-successiverefinementviabroadcastingoptimizingexpecteddistortionofagaussiansourceoveragaussianfadingchannel-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publicactions_v1.bib\" href=\"data:text/bibtex;base64,@article{6671968,
 abstract = {We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal in two general scenarios and is approximately optimal in a third scenario. The two scenarios for which separation is optimal complement each other: the first is when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, but the channels in this network are synchronized, orthogonal, and memoryless point-to-point channels; the second is when the memoryless sources are mutually independent, each of which is to be reconstructed only at one destination within a certain distortion, but the channels are general, including multi-user channels, such as multiple access, broadcast, interference, and relay channels, possibly with feedback. The third scenario, for which we demonstrate approximate optimality of source-channel separation, generalizes the second scenario by allowing each source to be reconstructed at multiple destinations with different distortions. For this case, the loss from optimality using the separation approach can be upper-bounded when a difference distortion measure is taken, and in the special case of quadratic distortion measure, this leads to universal constant bounds.},
 author = {Chao Tian and Jun Chen and Diggavi, S.N. and Shamai, S.},
 doi = {10.1109/TIT.2013.2291787},
 issn = {0018-9448},
 journal = {Information Theory, IEEE Transactions on},
 month = {Feb},
 number = {2},
 pages = {904-918},
 tags = {journal,SrcChan,IT},
 title = {Optimality and Approximate Optimality of Source-Channel Separation in Networks},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/1004.2648},
 volume = {60},
 year = {2014}
}



@article{7920290,
 abstract = {We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the sources, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters satisfy certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. Explicit and novel outer bounds are derived for the two problems as the byproducts of our investigation.},
 author = {C. {Tian} and J. {Chen} and S. N. {Diggavi} and S. {Shamai Shitz}},
 doi = {10.1109/TIT.2017.2701807},
 issn = {1557-9654},
 journal = {IEEE Transactions on Information Theory},
 keywords = {broadcast channels;Gaussian channels;mean square error methods;multiuser channels;matched multiuser Gaussian source channel communications;uncoded schemes;Gaussian broadcast channel;mean squared error distortion measure;correlated Gaussian sources;Gaussian multiple-access channel;mean squared error distortion;distortion tuples;optimization problem;region characterization problems;Distortion;Distortion measurement;Optimization;Receivers;Noise measurement;Decoding;Encoding;Broadcast;multiple access;combined source-channel coding},
 month = {July},
 number = {7},
 pages = {4155-4171},
 tags = {journal,IT,SCS},
 title = {Matched Multiuser Gaussian Source Channel Communications via Uncoded Schemes},
 type = {2},
 volume = {63},
 year = {2017}
}



@article{8335768,
 abstract = {This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.},
 author = {J. {Hachem} and U. {Niesen} and S. {Diggavi}},
 doi = {10.1109/LCOMM.2018.2822694},
 issn = {1558-2558},
 journal = {IEEE Communications Letters},
 keywords = {array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks},
 month = {July},
 number = {7},
 pages = {1434-1437},
 tags = {journal,CCWN,IT,ANIT,WiNetnew,SCS},
 title = {Energy-Efficiency Gains of Caching for Interference Channels},
 type = {2},
 url_arxiv = {https://arxiv.org/abs/1808.00653},
 volume = {22},
 year = {2018}
}



@inproceedings{DDCj06,
 author = {S. Dusad and S N. Diggavi and A R. Calderbank},
 booktitle = {IEEE Conference on Information Sciences and Systems, Princeton},
 month = {March},
 note = {invited paper},
 pages = {},
 tags = {conf,DivEmb,OppComm,SrcChan},
 title = {Cross Layer Utility of Diversity Embedded Codes},
 type = {4},
 year = {2006}
}



@article{hachem2018degrees,
 abstract = {We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.},
 author = {Hachem, Jad and Niesen, Urs and Diggavi, Suhas N},
 journal = {IEEE Transactions on Information Theory},
 number = {7},
 pages = {5359--5380},
 publisher = {IEEE},
 tags = {journal,CCWN,IT,WiNetnew,SCS,ANIT},
 title = {Degrees of freedom of cache-aided wireless interference networks},
 type = {2},
 url_arxiv = {https://arxiv.org/abs/1606.03175},
 doi = {10.1109/TIT.2018.2825321},
 volume = {64},
 year = {2018}
}



@article{hachem2020caching,
 author = {Hachem, J. and Niesen, U. and Diggavi, S.},
 editor = {Poor, Vince and Chen, Wei},
 journal = {Edge Caching for Mobile Networks},
 publisher = {Institute of Engineering and Technology (IET) Press},
 tags = {BookChap,CCWN,IT,ANIT,WiNetnew,SCS},
 title = {Caching for Interference Networks: A Separation Architecture},
 type = {3},
 year = {2020}
}



@article{kdw_j11,
 abstract = {We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.},
 author = {Khisti, A and Diggavi, S.N. and Wornell, Gregory W.},
 doi = {10.1109/TIT.2011.2173629},
 file = {:papers:secret_keygen.pdf},
 issn = {0018-9448},
 journal = {Information Theory, IEEE Transactions on},
 label = {kdw_j11},
 month = {Feb},
 number = {2},
 pages = {652-670},
 tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},
 title = {Secret-Key Generation Using Correlated Sources and Channels},
 type = {2},
 volume = {58},
 year = {2012}
}



@inproceedings{KDWj08,
 author = {A. Khisti and S N. Diggavi and G W. Wornell,},
 booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},
 month = {July},
 note = {},
 pages = {1005--1009},
 tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},
 title = {Secret key generation with correlated sources and noisy channels},
 type = {4},
 year = {2008}
}



@inproceedings{MTDp10,
 abstract = {Lossless transmission of a set of correlated sources
over a deterministic relay network is considered for two traffic
requirements. In distributed multicast, the set of sources are
to be delivered to a set of destinations. The source exchange
requires all the nodes with access to sources to be able to
reconstruct all other sources observed at other nodes. We develop
achievable regions and outer bounds for both these situations. For
linear deterministic networks, these bounds coincide, yielding a
characterization.},
 author = {S. Mohajer and C. Tian and S.N. Diggavi},
 booktitle = {IEEE Information Theory Workshop (ITW) Cairo},
 file = {:papers:mtd_itw10_final.pdf},
 month = {January},
 note = {},
 pages = {},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SrcChan,SrcChanSep,NDC,InfExch,SelConf},
 title = {On source transmission over deterministic relay networks},
 type = {4},
 year = {2010}
}



@inproceedings{TCDSc10a,
 author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},
 booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},
 month = {June},
 note = {},
 pages = {495--499},
 tags = {conf,SrcChan,ITapprox,NDC,IT},
 title = {Optimality and approximate optimality of source-channel 
separation in networks},
 type = {4},
 year = {2010}
}



@inproceedings{TCDSc10b,
 abstract = {We consider the source-channel separation architecture
for lossy source coding in communication networks. It
is shown that the separation approach is optimal when the
memoryless sources at source nodes are arbitrarily correlated,
each of which is to be reconstructed at possibly multiple
destinations within certain distortions, and the channels in this
network are synchronized, orthogonal and memoryless (i.e., noisy
graphs).},
 author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},
 booktitle = {International Conference on Signal Processing and Communications (SPCOM)},
 file = {:papers:tcdsspcom10.pdf},
 month = {June},
 note = {},
 pages = {1--5},
 tags = {conf,SrcChan,ITapprox,NDC,IT,SelConf},
 title = {On source-channel separation in networks},
 type = {4},
 year = {2010}
}



@inproceedings{TDSc10a,
 author = {C. Tian and  S N. Diggavi and S. Shamai},
 booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},
 month = {June},
 note = {},
 pages = {146--150},
 tags = {conf,SrcChan,NDC,IT},
 title = {The achievable distortion region of bivariate Gaussian source on 
Gaussian broadcast channel},
 type = {4},
 year = {2010}
}



@inproceedings{TDSj09,
 author = {C. Tian and S N. Diggavi and S. Shamai,},
 booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},
 month = {June},
 note = {},
 pages = {2477--2481},
 tags = {conf,SrcChan,ApproxIT,NDC,IT},
 title = {An Approximate Characterization For the Gaussian Broadcasting Distortion Region},
 type = {4},
 year = {2009}
}



@article{TDSj10a,
 abstract = {We show that source-channel separation is approximately optimal for transmitting
a Gaussian source over a bandwidth mismatched Gaussian channel, for quadratic distortion
measures. Furthermore, we show that the results can be extended to
general broadcast channels, and the performance of the source-channel
separation based approach is also within the same
constant multiplicative factors of the optimum.},
 author = {C. Tian and  S N. Diggavi and S. Shamai(Shitz)},
 file = {:papers:gaussianscbc_final.pdf},
 journal = {IEEE Transactions on Information Theory},
 label = {tds_j11a},
 month = {January},
 note = {},
 number = {1},
 pages = {124-136},
 tags = {journal,SrcChan,ApproxIT,NDC,IT},
 title = {Approximate Characterizations for the Gaussian Broadcasting Distortion Region},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/0906.3183},
 volume = {57},
 year = {2011}
}



@inproceedings{TSSDj07,
 author = {C. Tian and A. Steiner and S. Shamai and S N. Diggavi},
 booktitle = {IEEE Information Theory Workshop (ITW) Bergen, Norway},
 month = {July},
 note = {},
 pages = {42--46},
 tags = {conf,SrcChan,IT},
 title = {Expected distortion for Gaussian source with broadcast transmission strategy over a fading channel},
 type = {4},
 year = {2007}
}



@article{TSSDj08,
 abstract = {We consider the problem of transmitting a Gaussian
source on a slowly fading Gaussian channel, subject to the mean
squared error distortion measure.  We propose an
efficient algorithm to compute the optimal expected distortion at the
receiver in linear time O(M), when the total number of possible discrete fading
states is M. We also provide a derivation of the optimal
power allocation when the fading state is a continuum, using the
classical variational method.},
 author = {C. Tian and A. Steiner and S. Shamai(Shitz) and S N. Diggavi},
 file = {:papers:distortionbc_tssdfinal.pdf},
 journal = {IEEE Transactions on Information Theory},
 month = {July},
 note = {},
 number = {7},
 pages = {2903--2918},
 tags = {journal,SrcChan,IT},
 title = {Successive Refinement via Broadcasting: Optimizing Expected Distortion of a Gaussian Source over a Gaussian Fading Channel},
 type = {2},
 volume = {54},
 year = {2008}
}

\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(SCS|SrcChan)&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(SCS|SrcChan)&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(SCS|SrcChan)&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_3\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_3')\"\n      onkeypress=\"toggleGroup('group_3')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>3</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hachem-niesen-diggavi-cachingforinterferencenetworksaseparationarchitecture-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Hachem;  U. Niesen;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Caching for Interference Networks: A Separation Architecture.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Edge Caching for Mobile Networks</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hachem-niesen-diggavi-cachingforinterferencenetworksaseparationarchitecture-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hachem-niesen-diggavi-cachingforinterferencenetworksaseparationarchitecture-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hachem2020caching,\n author = {Hachem, J. and Niesen, U. and Diggavi, S.},\n editor = {Poor, Vince and Chen, Wei},\n journal = {Edge Caching for Mobile Networks},\n publisher = {Institute of Engineering and Technology (IET) Press},\n tags = {BookChap,CCWN,IT,ANIT,WiNetnew,SCS},\n title = {Caching for Interference Networks: A Separation Architecture},\n type = {3},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Hachem;  U. Niesen;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1808.00653\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018', 'https://arxiv.org/abs/1808.00653', event);\">\n    Energy-Efficiency Gains of Caching for Interference Channels.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Communications Letters</i>, 22(7): 1434-1437. July 2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1808.00653\"\n     onclick=\"log_download('hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018', 'https://arxiv.org/abs/1808.00653', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Energy-Efficiency Gains of Caching for Interference Channels [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/LCOMM.2018.2822694\"\n     onclick=\"log_download('hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018', 'http://doi.org/10.1109/LCOMM.2018.2822694', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{8335768,\n abstract = {This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.},\n author = {J. {Hachem} and U. {Niesen} and S. {Diggavi}},\n doi = {10.1109/LCOMM.2018.2822694},\n issn = {1558-2558},\n journal = {IEEE Communications Letters},\n keywords = {array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks},\n month = {July},\n number = {7},\n pages = {1434-1437},\n tags = {journal,CCWN,IT,ANIT,WiNetnew,SCS},\n title = {Energy-Efficiency Gains of Caching for Interference Channels},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1808.00653},\n volume = {22},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Jad Hachem;  Urs Niesen;  and  Suhas N Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1606.03175\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018', 'https://arxiv.org/abs/1606.03175', event);\">\n    Degrees of freedom of cache-aided wireless interference networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 64(7): 5359–5380.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1606.03175\"\n     onclick=\"log_download('hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018', 'https://arxiv.org/abs/1606.03175', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Degrees of freedom of cache-aided wireless interference networks [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2018.2825321\"\n     onclick=\"log_download('hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018', 'http://doi.org/10.1109/TIT.2018.2825321', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hachem2018degrees,\n abstract = {We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system&#x27;s degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.},\n author = {Hachem, Jad and Niesen, Urs and Diggavi, Suhas N},\n journal = {IEEE Transactions on Information Theory},\n number = {7},\n pages = {5359--5380},\n publisher = {IEEE},\n tags = {journal,CCWN,IT,WiNetnew,SCS,ANIT},\n title = {Degrees of freedom of cache-aided wireless interference networks},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1606.03175},\n doi = {10.1109/TIT.2018.2825321},\n volume = {64},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"tian-chen-diggavi-shamaishitz-matchedmultiusergaussiansourcechannelcommunicationsviauncodedschemes-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  J. Chen;  S. N. Diggavi;  and  S. Shamai Shitz.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Matched Multiuser Gaussian Source Channel Communications via Uncoded Schemes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 63(7): 4155-4171. July 2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2017.2701807\"\n     onclick=\"log_download('tian-chen-diggavi-shamaishitz-matchedmultiusergaussiansourcechannelcommunicationsviauncodedschemes-2017', 'http://doi.org/10.1109/TIT.2017.2701807', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-chen-diggavi-shamaishitz-matchedmultiusergaussiansourcechannelcommunicationsviauncodedschemes-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-chen-diggavi-shamaishitz-matchedmultiusergaussiansourcechannelcommunicationsviauncodedschemes-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{7920290,\n abstract = {We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the sources, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters satisfy certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. Explicit and novel outer bounds are derived for the two problems as the byproducts of our investigation.},\n author = {C. {Tian} and J. {Chen} and S. N. {Diggavi} and S. {Shamai Shitz}},\n doi = {10.1109/TIT.2017.2701807},\n issn = {1557-9654},\n journal = {IEEE Transactions on Information Theory},\n keywords = {broadcast channels;Gaussian channels;mean square error methods;multiuser channels;matched multiuser Gaussian source channel communications;uncoded schemes;Gaussian broadcast channel;mean squared error distortion measure;correlated Gaussian sources;Gaussian multiple-access channel;mean squared error distortion;distortion tuples;optimization problem;region characterization problems;Distortion;Distortion measurement;Optimization;Receivers;Noise measurement;Decoding;Encoding;Broadcast;multiple access;combined source-channel coding},\n month = {July},\n number = {7},\n pages = {4155-4171},\n tags = {journal,IT,SCS},\n title = {Matched Multiuser Gaussian Source Channel Communications via Uncoded Schemes},\n type = {2},\n volume = {63},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the sources, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters satisfy certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. Explicit and novel outer bounds are derived for the two problems as the byproducts of our investigation.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Chao Tian;  Jun Chen;  S.N. Diggavi;  and  S. Shamai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1004.2648\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2014', 'http://arxiv.org/abs/1004.2648', event);\">\n    Optimality and Approximate Optimality of Source-Channel Separation in Networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Information Theory, IEEE Transactions on</i>, 60(2): 904-918. Feb 2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1004.2648\"\n     onclick=\"log_download('tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2014', 'http://arxiv.org/abs/1004.2648', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Optimality and Approximate Optimality of Source-Channel Separation in Networks [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2013.2291787\"\n     onclick=\"log_download('tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2014', 'http://doi.org/10.1109/TIT.2013.2291787', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{6671968,\n abstract = {We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal in two general scenarios and is approximately optimal in a third scenario. The two scenarios for which separation is optimal complement each other: the first is when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, but the channels in this network are synchronized, orthogonal, and memoryless point-to-point channels; the second is when the memoryless sources are mutually independent, each of which is to be reconstructed only at one destination within a certain distortion, but the channels are general, including multi-user channels, such as multiple access, broadcast, interference, and relay channels, possibly with feedback. The third scenario, for which we demonstrate approximate optimality of source-channel separation, generalizes the second scenario by allowing each source to be reconstructed at multiple destinations with different distortions. For this case, the loss from optimality using the separation approach can be upper-bounded when a difference distortion measure is taken, and in the special case of quadratic distortion measure, this leads to universal constant bounds.},\n author = {Chao Tian and Jun Chen and Diggavi, S.N. and Shamai, S.},\n doi = {10.1109/TIT.2013.2291787},\n issn = {0018-9448},\n journal = {Information Theory, IEEE Transactions on},\n month = {Feb},\n number = {2},\n pages = {904-918},\n tags = {journal,SrcChan,IT},\n title = {Optimality and Approximate Optimality of Source-Channel Separation in Networks},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/1004.2648},\n volume = {60},\n year = {2014}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal in two general scenarios and is approximately optimal in a third scenario. The two scenarios for which separation is optimal complement each other: the first is when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, but the channels in this network are synchronized, orthogonal, and memoryless point-to-point channels; the second is when the memoryless sources are mutually independent, each of which is to be reconstructed only at one destination within a certain distortion, but the channels are general, including multi-user channels, such as multiple access, broadcast, interference, and relay channels, possibly with feedback. The third scenario, for which we demonstrate approximate optimality of source-channel separation, generalizes the second scenario by allowing each source to be reconstructed at multiple destinations with different distortions. For this case, the loss from optimality using the separation approach can be upper-bounded when a difference distortion measure is taken, and in the special case of quadratic distortion measure, this leads to universal constant bounds.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A Khisti;  S.N. Diggavi;  and  Gregory W. Wornell.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret-Key Generation Using Correlated Sources and Channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Information Theory, IEEE Transactions on</i>, 58(2): 652-670. Feb 2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2011.2173629\"\n     onclick=\"log_download('khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012', 'http://doi.org/10.1109/TIT.2011.2173629', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('khisti-diggavi-wornell-secretkeygenerationusingcorrelatedsourcesandchannels-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{kdw_j11,\n abstract = {We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.},\n author = {Khisti, A and Diggavi, S.N. and Wornell, Gregory W.},\n doi = {10.1109/TIT.2011.2173629},\n file = {:papers:secret_keygen.pdf},\n issn = {0018-9448},\n journal = {Information Theory, IEEE Transactions on},\n label = {kdw_j11},\n month = {Feb},\n number = {2},\n pages = {652-670},\n tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},\n title = {Secret-Key Generation Using Correlated Sources and Channels},\n type = {2},\n volume = {58},\n year = {2012}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2011\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2011')\"\n      onkeypress=\"toggleGroup('group_2011')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2011</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"tian-diggavi-shamaishitz-approximatecharacterizationsforthegaussianbroadcastingdistortionregion-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  S N. Diggavi;  and  S. Shamai(Shitz).\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/0906.3183\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'tian-diggavi-shamaishitz-approximatecharacterizationsforthegaussianbroadcastingdistortionregion-2011', 'http://arxiv.org/abs/0906.3183', event);\">\n    Approximate Characterizations for the Gaussian Broadcasting Distortion Region.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 57(1): 124-136. January 2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/0906.3183\"\n     onclick=\"log_download('tian-diggavi-shamaishitz-approximatecharacterizationsforthegaussianbroadcastingdistortionregion-2011', 'http://arxiv.org/abs/0906.3183', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Approximate Characterizations for the Gaussian Broadcasting Distortion Region [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-diggavi-shamaishitz-approximatecharacterizationsforthegaussianbroadcastingdistortionregion-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-diggavi-shamaishitz-approximatecharacterizationsforthegaussianbroadcastingdistortionregion-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{TDSj10a,\n abstract = {We show that source-channel separation is approximately optimal for transmitting\na Gaussian source over a bandwidth mismatched Gaussian channel, for quadratic distortion\nmeasures. Furthermore, we show that the results can be extended to\ngeneral broadcast channels, and the performance of the source-channel\nseparation based approach is also within the same\nconstant multiplicative factors of the optimum.},\n author = {C. Tian and  S N. Diggavi and S. Shamai(Shitz)},\n file = {:papers:gaussianscbc_final.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {tds_j11a},\n month = {January},\n note = {},\n number = {1},\n pages = {124-136},\n tags = {journal,SrcChan,ApproxIT,NDC,IT},\n title = {Approximate Characterizations for the Gaussian Broadcasting Distortion Region},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0906.3183},\n volume = {57},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We show that source-channel separation is approximately optimal for transmitting a Gaussian source over a bandwidth mismatched Gaussian channel, for quadratic distortion measures. Furthermore, we show that the results can be extended to general broadcast channels, and the performance of the source-channel separation based approach is also within the same constant multiplicative factors of the optimum.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mohajer-tian-diggavi-onsourcetransmissionoverdeterministicrelaynetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  C. Tian;  and  S.N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On source transmission over deterministic relay networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW) Cairo</i>, January 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-tian-diggavi-onsourcetransmissionoverdeterministicrelaynetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-tian-diggavi-onsourcetransmissionoverdeterministicrelaynetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MTDp10,\n abstract = {Lossless transmission of a set of correlated sources\nover a deterministic relay network is considered for two traffic\nrequirements. In distributed multicast, the set of sources are\nto be delivered to a set of destinations. The source exchange\nrequires all the nodes with access to sources to be able to\nreconstruct all other sources observed at other nodes. We develop\nachievable regions and outer bounds for both these situations. For\nlinear deterministic networks, these bounds coincide, yielding a\ncharacterization.},\n author = {S. Mohajer and C. Tian and S.N. Diggavi},\n booktitle = {IEEE Information Theory Workshop (ITW) Cairo},\n file = {:papers:mtd_itw10_final.pdf},\n month = {January},\n note = {},\n pages = {},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SrcChan,SrcChanSep,NDC,InfExch,SelConf},\n title = {On source transmission over deterministic relay networks},\n type = {4},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all the nodes with access to sources to be able to reconstruct all other sources observed at other nodes. We develop achievable regions and outer bounds for both these situations. For linear deterministic networks, these bounds coincide, yielding a characterization.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  J. Chen;  S N. Diggavi;  and  S. Shamai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Optimality and approximate optimality of source-channel separation in networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proc. of IEEE ISIT 2010, Austin, Texas</i>, pages 495–499, June 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{TCDSc10a,\n author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\n month = {June},\n note = {},\n pages = {495--499},\n tags = {conf,SrcChan,ITapprox,NDC,IT},\n title = {Optimality and approximate optimality of source-channel \nseparation in networks},\n type = {4},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tian-chen-diggavi-shamai-onsourcechannelseparationinnetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  J. Chen;  S N. Diggavi;  and  S. Shamai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On source-channel separation in networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Signal Processing and Communications (SPCOM)</i>, pages 1–5, June 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-chen-diggavi-shamai-onsourcechannelseparationinnetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-chen-diggavi-shamai-onsourcechannelseparationinnetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{TCDSc10b,\n abstract = {We consider the source-channel separation architecture\nfor lossy source coding in communication networks. It\nis shown that the separation approach is optimal when the\nmemoryless sources at source nodes are arbitrarily correlated,\neach of which is to be reconstructed at possibly multiple\ndestinations within certain distortions, and the channels in this\nnetwork are synchronized, orthogonal and memoryless (i.e., noisy\ngraphs).},\n author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},\n booktitle = {International Conference on Signal Processing and Communications (SPCOM)},\n file = {:papers:tcdsspcom10.pdf},\n month = {June},\n note = {},\n pages = {1--5},\n tags = {conf,SrcChan,ITapprox,NDC,IT,SelConf},\n title = {On source-channel separation in networks},\n type = {4},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, and the channels in this network are synchronized, orthogonal and memoryless (i.e., noisy graphs).\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tian-diggavi-shamai-theachievabledistortionregionofbivariategaussiansourceongaussianbroadcastchannel-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  S N. Diggavi;  and  S. Shamai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The achievable distortion region of bivariate Gaussian source on Gaussian broadcast channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proc. of IEEE ISIT 2010, Austin, Texas</i>, pages 146–150, June 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-diggavi-shamai-theachievabledistortionregionofbivariategaussiansourceongaussianbroadcastchannel-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-diggavi-shamai-theachievabledistortionregionofbivariategaussiansourceongaussianbroadcastchannel-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{TDSc10a,\n author = {C. Tian and  S N. Diggavi and S. Shamai},\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\n month = {June},\n note = {},\n pages = {146--150},\n tags = {conf,SrcChan,NDC,IT},\n title = {The achievable distortion region of bivariate Gaussian source on \nGaussian broadcast channel},\n type = {4},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"tian-diggavi-sshamai-anapproximatecharacterizationforthegaussianbroadcastingdistortionregion-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  S N. Diggavi;  and   S. Shamai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Approximate Characterization For the Gaussian Broadcasting Distortion Region.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT), Seoul, Korea</i>, pages 2477–2481, June 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-diggavi-sshamai-anapproximatecharacterizationforthegaussianbroadcastingdistortionregion-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-diggavi-sshamai-anapproximatecharacterizationforthegaussianbroadcastingdistortionregion-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{TDSj09,\n author = {C. Tian and S N. Diggavi and S. Shamai,},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},\n month = {June},\n note = {},\n pages = {2477--2481},\n tags = {conf,SrcChan,ApproxIT,NDC,IT},\n title = {An Approximate Characterization For the Gaussian Broadcasting Distortion Region},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"tian-steiner-shamaishitz-diggavi-successiverefinementviabroadcastingoptimizingexpecteddistortionofagaussiansourceoveragaussianfadingchannel-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  A. Steiner;  S. Shamai(Shitz);  and  S N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Successive Refinement via Broadcasting: Optimizing Expected Distortion of a Gaussian Source over a Gaussian Fading Channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 54(7): 2903–2918. July 2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-steiner-shamaishitz-diggavi-successiverefinementviabroadcastingoptimizingexpecteddistortionofagaussiansourceoveragaussianfadingchannel-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-steiner-shamaishitz-diggavi-successiverefinementviabroadcastingoptimizingexpecteddistortionofagaussiansourceoveragaussianfadingchannel-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{TSSDj08,\n abstract = {We consider the problem of transmitting a Gaussian\nsource on a slowly fading Gaussian channel, subject to the mean\nsquared error distortion measure.  We propose an\nefficient algorithm to compute the optimal expected distortion at the\nreceiver in linear time O(M), when the total number of possible discrete fading\nstates is M. We also provide a derivation of the optimal\npower allocation when the fading state is a continuum, using the\nclassical variational method.},\n author = {C. Tian and A. Steiner and S. Shamai(Shitz) and S N. Diggavi},\n file = {:papers:distortionbc_tssdfinal.pdf},\n journal = {IEEE Transactions on Information Theory},\n month = {July},\n note = {},\n number = {7},\n pages = {2903--2918},\n tags = {journal,SrcChan,IT},\n title = {Successive Refinement via Broadcasting: Optimizing Expected Distortion of a Gaussian Source over a Gaussian Fading Channel},\n type = {2},\n volume = {54},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem of transmitting a Gaussian source on a slowly fading Gaussian channel, subject to the mean squared error distortion measure. We propose an efficient algorithm to compute the optimal expected distortion at the receiver in linear time O(M), when the total number of possible discrete fading states is M. We also provide a derivation of the optimal power allocation when the fading state is a continuum, using the classical variational method.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"khisti-diggavi-gwwornell-secretkeygenerationwithcorrelatedsourcesandnoisychannels-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Khisti;  S N. Diggavi;  and   G W. Wornell.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Secret key generation with correlated sources and noisy channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT), Toronto, Canada</i>, pages 1005–1009, July 2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/khisti-diggavi-gwwornell-secretkeygenerationwithcorrelatedsourcesandnoisychannels-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('khisti-diggavi-gwwornell-secretkeygenerationwithcorrelatedsourcesandnoisychannels-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{KDWj08,\n author = {A. Khisti and S N. Diggavi and G W. Wornell,},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},\n month = {July},\n note = {},\n pages = {1005--1009},\n tags = {conf,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},\n title = {Secret key generation with correlated sources and noisy channels},\n type = {4},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2007\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2007')\"\n      onkeypress=\"toggleGroup('group_2007')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2007</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"tian-steiner-shamai-diggavi-expecteddistortionforgaussiansourcewithbroadcasttransmissionstrategyoverafadingchannel-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  A. Steiner;  S. Shamai;  and  S N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Expected distortion for Gaussian source with broadcast transmission strategy over a fading channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW) Bergen, Norway</i>, pages 42–46, July 2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-steiner-shamai-diggavi-expecteddistortionforgaussiansourcewithbroadcasttransmissionstrategyoverafadingchannel-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-steiner-shamai-diggavi-expecteddistortionforgaussiansourcewithbroadcasttransmissionstrategyoverafadingchannel-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{TSSDj07,\n author = {C. Tian and A. Steiner and S. Shamai and S N. Diggavi},\n booktitle = {IEEE Information Theory Workshop (ITW) Bergen, Norway},\n month = {July},\n note = {},\n pages = {42--46},\n tags = {conf,SrcChan,IT},\n title = {Expected distortion for Gaussian source with broadcast transmission strategy over a fading channel},\n type = {4},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2006\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2006')\"\n      onkeypress=\"toggleGroup('group_2006')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2006</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dusad-diggavi-calderbank-crosslayerutilityofdiversityembeddedcodes-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Dusad;  S N. Diggavi;  and  A R. Calderbank.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Cross Layer Utility of Diversity Embedded Codes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Conference on Information Sciences and Systems, Princeton</i>, March 2006. \n  <span class=\"note\">invited paper</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dusad-diggavi-calderbank-crosslayerutilityofdiversityembeddedcodes-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dusad-diggavi-calderbank-crosslayerutilityofdiversityembeddedcodes-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DDCj06,\n author = {S. Dusad and S N. Diggavi and A R. Calderbank},\n booktitle = {IEEE Conference on Information Sciences and Systems, Princeton},\n month = {March},\n note = {invited paper},\n pages = {},\n tags = {conf,DivEmb,OppComm,SrcChan},\n title = {Cross Layer Utility of Diversity Embedded Codes},\n type = {4},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);